A Study of Convergence and Mapping in Multiobjective Optimization Problems
نویسندگان
چکیده
In this paper, we investigate the issue of convergence in multiobjective optimization problems when using a MultiObjective Genetic Algorithm (MOGA) to determine the set of Pareto optimal solutions. Additionally, given a Pareto set for a multi-objective problem, the mapping between the performance and design space is studied to determine design variable configurations for a given set of performance specifications. The advantage of this study is that the design variable information is obtained without having to repeat system analyses. The tools developed in this paper have been applied to develop a Technical Feasibility Model (TFM) used by General Motors as well as a simple multiobjective optimization problem in this paper. The multi-objective problem is primarily used to illustrate the developed methodology.
منابع مشابه
Multiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems
Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...
متن کاملAn algorithm for approximating nondominated points of convex multiobjective optimization problems
In this paper, we present an algorithm for generating approximate nondominated points of a multiobjective optimization problem (MOP), where the constraints and the objective functions are convex. We provide outer and inner approximations of nondominated points and prove that inner approximations provide a set of approximate weakly nondominated points. The proposed algorithm can be appl...
متن کاملQuasi-Newton Methods for Nonconvex Constrained Multiobjective Optimization
Here, a quasi-Newton algorithm for constrained multiobjective optimization is proposed. Under suitable assumptions, global convergence of the algorithm is established.
متن کاملQuasi-Gap and Gap Functions for Non-Smooth Multi-Objective Semi-Infinite Optimization Problems
In this paper, we introduce and study some new single-valued gap functions for non-differentiable semi-infinite multiobjective optimization problems with locally Lipschitz data. Since one of the fundamental properties of gap function for optimization problems is its abilities in characterizing the solutions of the problem in question, then the essential properties of the newly introduced ...
متن کاملA Survey on Different Solution Concepts in Multiobjective Linear Programming Problems with Interval Coefficients
Optimization problems have dedicated a branch of research to themselves for a long time ago. In this field, multiobjective programming has special importance. Since in most real-world multiobjective programming problems the possibility of determining the coefficients certainly is not existed, multiobjective linear programming problems with interval coefficients are investigated in this paper. C...
متن کامل